Adding Global Forbidding Context to Context-Free Grammars

نویسندگان

  • Andrzej Ehrenfeucht
  • Jetty Kleijn
  • Grzegorz Rozenberg
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions

This paper answers three open questions concerning the generative power of some simple variants of context-free grammars regulated by context conditions. Specifically, it discusses the generative power of so-called contextfree semi-conditional grammars (which are random context grammars where permitting and forbidding sets are replaced with permitting and forbidding strings) where permitting an...

متن کامل

Ogden’s Lemma for Random Permitting and Forbidding Context Picture Languages and Table-Driven Context-Free Picture Languages

Random context picture grammars are used to generate pictures through successive refinement. There are three important subclasses of random context picture grammars, namely random permitting context picture grammars, random forbidding context picture grammars and table-driven context-free picture grammars. These grammars generate the random permitting context picture languages, random forbiddin...

متن کامل

On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components

This paper discusses the terminating derivation mode in cooperating distributed grammar systems where components are forbidding grammars instead of context-free grammars. Such systems are called forbidding cooperating distributed grammar systems, and it is demonstrated that the number of their components can be reduced to two without changing the generative power and that these systems are comp...

متن کامل

Generalized Random Context Picture Grammars: The State of the Art

We present a summary of results on random context picture grammars (rcpgs), which are a method of syntactic picture generation. The productions of such a grammar are context-free, but their application is regulated—permitted or forbidden—by context randomly distributed in the developing picture. Thus far we have investigated three important subclasses of rcpgs, namely random permitting context ...

متن کامل

A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking

Extended Abstract Rewriting systems based on simple forms of productions play an important role in formal language theory. Therefore, it is no surprise that context-free grammars and their modifications are one of the most studied models. However, many of the systems describing practically interesting applications, such as the parsers of natural and programming languages, require additional mec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 37  شماره 

صفحات  -

تاریخ انتشار 1985